Branching Program Size Is Almost Linear in Formula Size
نویسندگان
چکیده
منابع مشابه
Relating Branching Program Size and Formula Size over the Full Binary Basis
Circuit size, branching program size, and formula size of Boolean functions, denoted by C(f), BP(f), and L(f), are the most important complexity measures for Boolean functions. Often also the formula size L (f) over the restricted basis f_;^;:g is considered. It is well-known that C(f) 3BP(f), BP(f) L (f), L (f) L(f)2, and C(f) L(f) 1. These estimates are optimal. But the inequality BP(f) L(f)2...
متن کاملAn Almost-Quadratic Lower Bound for Quantum Formula Size
We show that Nechiporuk’s method [14] for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an Ω(n2/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [15] states that the majority function does not have a linear–size quantum formula.
متن کاملCone size is related to branching architecture in conifers.
The relationship between branch diameter and leaf size has been widely used to understand how vegetative resources are allocated in plants. Branching architecture influences reproductive allocation as well, but fewer studies have explored this relationship at broad phylogenetic or ecological scales. In this study, we tested whether pollen-producing and seed-producing cone size scales with branc...
متن کاملMultireference second-order perturbation theory: how size consistent is "almost size consistent".
A systematic study of the deviation from size consistency of the multireference second-order Moller-Plesset perturbation theory (MRMP2) method is presented. The size-consistency error is shown to depend on the number of monomers in a supermolecule calculation, size of basis set, number of correlated valence electrons, and size of active space. HF, F(2), and N(2) are used as test cases, with str...
متن کاملThe formula size of PARITY
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2, then the formula size of parity on n bits is 2(2 +3k) = n + k2 − k. Khraphchenko 1971 had previously shown a n lower bound on the formula size of parity—our result shows that when n is not a power of two parity requires larger formulas, and in fact that limn→∞ sup of the formula size of parity is (9/8)n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2001
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1762